Modular Logic Programs over Finite Domains

In this paper we study the properties of a compositional semantics for logic programs and its applications to modular analysis and logic-based databases, focusing on programs deened on a nite domain (i.e. on a function free nite signature). By this restriction we obtain a nite characterization of the compositional semantics which has the same correctness and compositionality properties of the original ((xpoint-based) deenition, even if the latter could introduce innnite de-notations also for nite domains programs. This property is particularly suitable for semantics-based program analysis, since it allows to identify a class of abstract domains for which the same nite characterization of the (abstract) compositional semantics holds. By combining this result with an existing framework for the modular analysis of logic programs, we can obtain a compositional analysis without requiring an additional level of abstraction. The niteness of our characterization can also be useful for the modular construction and the uniform compilation of Datalog programs.